Universal Constructs in Distributed Computations
نویسندگان
چکیده
This paper presents two classes of universal constructs that occur in distributed computations and explores their properties. It first examines a pair of universal constructs termed IO and OI intervals that occur at nodes in distributed computations. These universal constructs are used as building blocks to design two global universal constructs, termed segments and paths, that occur across nodes in distributed computations. These constructs are a generalization of causal chains in a distributed computation. While a causal chain only captures the causal relation, it turns out that message chains in a distributed computation that do not capture causality play a significant role in the analysis of a distributed computation. We show that a number of key concepts and structures characterizing distributed computations are special cases of and can be expressed in terms of the two proposed constructs.
منابع مشابه
JMAS: A Java-Based Mobile Actor System for Distributed Parallel Computation
JMAS is a prototype network computing infrastructure based on mobile actors [10] using Java technology. JMAS requires a programming style di erent from commonly used approaches to distributed computing. JMAS allows a programmer to create mobile actors, initialize their behaviors, and send them messages using constructs provided by the JMAS Mobile Actor API. Applications are decomposed by the pr...
متن کاملTuring Completeness Considered Harmful: Component Programming with a Simple Language
Languages are increasingly being used to reuse computations as components as well as to express these computations in the first place. However, the expression of computations and component assembly have opposing language requirements: the former requires flexible Turing-complete constructs that can express many interactions while the latter benefits from constructs that instead hide interaction...
متن کاملActor Languages for Speciication of Parallel Computations
We describe high-level language constructs for specifying parallel programs and show how they may be used to provide modular speci-cation of communication, synchronization and placement. The high-level constructs are translated into actors which provide exible low-level primi-tives for interconnecting distributed components and eecient execution on concurrent computers. We argue that our lingui...
متن کاملActor Languages for Specification of Parallel Computations
We describe high-level language constructs for specifying parallel programs and show how they may be used to provide modular speci-cation of communication, synchronization and placement. The high-level constructs are translated into actors which provide exible low-level primi-tives for interconnecting distributed components and eecient execution on concurrent computers. We argue that our lingui...
متن کاملA Fixpoint-Based Calculus for Graph-Shaped Computational Fields
Coordination is essential for dynamic distributed systems exhibiting autonomous behaviors. Spatially distributed, locally interacting, propagating computational fields are particularly appealing for allowing components to join and leave with little or no overhead. In our approach, the space topology is represented by a graph-shaped field, namely a network with attributes on both nodes and arcs,...
متن کامل